Path Symmetries in Undirected Uniform-Cost Grids
نویسندگان
چکیده
We explore a symmetry-based reformulation technique which can speed up optimal pathfinding on undirected uniform-cost grid maps by over 30 times. Our offline approach decomposes grid maps into a set of empty rectangles, removing from each all interior nodes and possibly some from along the perimeter. We then add macro-edges between selected pairs of remaining perimeter nodes to facilitate provably optimal traversal through each rectangle. To further speed up search, we also develop a novel online pruning technique. Our algorithm is fast, memory efficient and retains both optimality and completeness during search.
منابع مشابه
Using interpolation to improve path planning: The Field D* algorithm
We present an interpolation-based planning and replanning algorithm for generating low-cost paths through uniform and nonuniform resolution grids. Most grid-based path planners use discrete state transitions that artificially constrain an agent’s motion to a small set of possible headings e.g., 0, /4, /2, etc. . As a result, even “optimal” gridbased planners produce unnatural, suboptimal paths....
متن کاملOn Dynamic Identifying Codes
A walk c1, c2, . . . , cM in an undirected graph G = (V, E) is called a dynamic identifying code, if all the sets I(v) = {u ∈ C : d(u, v) ≤ 1} for v ∈ V are nonempty and no two of them are the same set. Here d(u, v) denotes the number of edges on any shortest path from u to v, and C = {c1, c2, . . . , cM}. We consider dynamic identifying codes in square grids, triangular grids, hexagonal meshes...
متن کاملThe Field D* Algorithm for Improved Path Planning and Replanning in Uniform and Non-Uniform Cost Environments
We present an interpolation-based planning and replanning algorithm for generating smooth paths through non-uniform cost grids. Most grid-based path planners use discrete state transitions that artificially constrain an agent’s motion to a small set of possible headings (e.g. 0, π 4 , π 2 , etc). As a result, even the ‘optimal’ grid planners produce unnatural, suboptimal paths for the agent to ...
متن کاملOn the second point-to-point undirected shortest simple path problem
We address the determination of the second point-to-point shortest simple path in undirected networks. The effective reduced cost concept is introduced to compute the second best solution. This concept is used to prove that a path tree containing the second point-to-point shortest simple path is adjacent to any shortest path tree. Therefore, this result immediately implies a methods requiring O...
متن کاملOn the Derivation of Highest-Order Compact Finite Difference Schemes for the One- and Two-Dimensional Poisson Equation with Dirichlet Boundary Conditions
The primary aim of this paper is to answer the question: what are the highest-order fiveor nine-point compact finite difference schemes? To answer this question, we present several simple derivations of finite difference schemes for the oneand two-dimensional Poisson equation on uniform, quasi-uniform, and non-uniform face-to-face hyper-rectangular grids and directly prove the existence or non-...
متن کامل